//#include<iostream>
//const int N = 1e6 + 10;
//int a[N];
//typedef long long ll;
//using namespace std;
//int main()
//{
//	int n;cin >> n;ll sum = 0;
//	for (int i = 1; i <= n; i++)
//	{
//		cin >> a[i];
//		sum += a[i];
//	}
//	int  left = 1, right = 1; ll k = 0, ret;
//	while (right <= n)
//	{
//		k += a[right];
//		while (k >= sum / 2)
//		{
//			ret = 
//		}
//	}
//
//	return 0;
//}
////#include<iostream>
////const int N = 1e6 + 10;
////int e[N], ne[N], id,x,n;
////using namespace std;
////void insert(int x,int i)
////{
////	id++;
////	e[id] = x;
////	if (id == n) ne[id] = 1;
////	else ne[id] = i + 1;
////}
////int main()
////{
////	cin >> n;
////	for (int i = 1; i <= n; i++)
////	{
////		cin >> x;
////		insert(x,i);
////	}
////	return 0;
////}